Improved Preimage Attacks on 3-Round Keccak-224/256
نویسندگان
چکیده
In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our is based the work by Li and Sun. Their strategy to find a 2-block instead 1-block one constructing first second message blocks in two stages. Under strategy, they design new linear structure for 2-round Keccak-224/256 with 194 degrees freedom left, which able construct block complexity 231/262. However, bottleneck that stage needs much more expense than one. Therefore, improve using techniques. The technique multi-block messages rather one-block stage, can reach better inner state. setting restricting equations efficiently, Keccak-256. As result, finding be decreased from 238/281 232/265.
منابع مشابه
Preimage attacks on the round-reduced Keccak with the aid of differential cryptanalysis
In this paper we use differential cryptanalysis to attack the winner of the SHA-3 competition, namely Keccak hash function. Despite more than 6 years of intensive cryptanalysis there have been known only two preimage attacks which reach 3 (or slightly more) rounds. Our 3-round preimage attack improves the complexity of those two existing attacks and it is obtained with a different technique. We...
متن کاملNew Collision Attacks on Round-Reduced Keccak
In this paper, we focus on collision attacks against Keccak hash function family and some of its variants. Following the framework developed by Dinur et al. at FSE 2012 where 4-round collisions were found by combining 3-round differential trails and 1-round connectors, we extend the connectors one round further hence achieve collision attacks for up to 5 rounds. The extension is possible thanks...
متن کاملPreimage Attacks on Reduced-Round Stribog
In August 2012, the Stribog hash function was selected as the new Russian cryptographic hash standard (GOST R 34.11-2012). Stribog employs twelve rounds of an AES-based compression function operating in Miyaguchi-Preneel mode. In this paper, we investigate the preimage resistance of the Stribog hash function. Specifically, we apply a meet in the middle preimage attack on the compression functio...
متن کاملPractical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function
In this paper we mount the cube attack on the Keccak sponge function. The cube attack, formally introduced in 2008, is an algebraic technique applicable to cryptographic primitives whose output can be described as a low-degree polynomial in the input. Our results show that 5and 6-round Keccak sponge function is vulnerable to this technique. All the presented attacks have practical complexities ...
متن کاملPractical (Second) Preimage Attacks on TCS_SHA-3
TCS SHA-3 is a family of four cryptographic hash functions that are covered by an US patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits. The hash functions use bijective functions in place of the standard, compression functions. In this paper we describe first and second preimage attacks on the full hash functions. The second preimage attack requires negligible time and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transaction on symmetric cryptology
سال: 2021
ISSN: ['2519-173X']
DOI: https://doi.org/10.46586/tosc.v2021.i3.84-101